Verification formelle et optimisation de l'allocation de registres

A New Fast Algorithm for Optimal Register Allocation in Modulo Scheduled Loops

In this paper, we focus on the register allocation phase of software pipelining. We are interested in optimal register allocation. This means that the number of registers used must be equal to the maximum number of simultaneously alive variables of the loop. Usually two diierent means are used to achieve this, namely register renaming or loop unrolling. As these methods have both drawbacks, we ...

Étude des problèmes de spilling et coalescing liés à l'allocation de registres en tant que deux phases distinctes. (A Study of Spilling and Coalescing in Register Allocation as Two Separate Phases)

A Tiling Perspective for Register Optimization

Register allocation is a much studied problem. A particularly important context for optimizing register allocation is within loops, since a significant fraction of the execution time of programs is often inside loop code. A variety of algorithms have been proposed in the past for register allocation, but the complexity of the problem has resulted in a decoupling of several important aspects, in...

Binary Heaps Formally Verified in Why3

The VACID-0 benchmarks is a set of small programs which pose challenges for formal verification of their functional behavior. This paper reports on the formal verification of one of these challenges: binary heaps. The solution given here is performed using the Why3 environment for program verification. The expected behavior of the program is specified in Why3 logic, structured using the constru...

Experimental Study of Register Saturation in Basic Blocks and Super-Blocks: Optimality and heuristics

Register saturation (RS) is the exact maximal register need of all valid schedules of a data dependence graph [4]. Its optimal computation is NP-complete. This report proposes two variants of heuristics for computing the acyclic RS of directed acyclic graphs (DAG). The first one improves the previous greedy-k heuristic [4] in terms of approximating the RS with equivalent computation times. The ...